This paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite: (a) there is an edge-recognition algorithm, i.e., an effective procedure which enables us, given two distinct vertices, to decide whether they are adjacent, (b) there is a shortest path algorithm, i.e., an effective procedure which enables us, given two distinct vertices, to find a minimal path joining them. A graph $G = \langle\eta, \eta\rangle$ with η as set (...) of vertices and η as set of edges is an α-graph if it satisfies (a); it is an ω-graph if it satisfies (b). G is called r.e. (isolic) if the sets ν and η are r.e. (isolated). While every ω-graph is an α-graph, the converse is false, even if G is r.e. or isolic. Several basic properties of finite graphs do not generalize to ω-graphs. For example, an ω-tree with more than one vertex need not have two pendant vertices, but may have only one or none, since it may be a 1-way or 2-way infinite path. Nevertheless, some elementary propositions for finite graphs $G = \langle\nu, \eta\rangle$ with $n = \operatorname{card}(\nu), e = \operatorname{card}(\eta)$ , do generalize to isolic ω-graphs, e.g., n - 1 ≤ e ≤ n(n - 1)/2. Let N and E be the recursive equivalence types of ν and η respectively. Then we have for an isolic α-tree $G = \langle\nu, \eta\rangle: N = E + 1$ iff G is an ω-tree. The theorem that every finite graph has a spanning tree has a natural, effective analogue for ω-graphs. The structural difference between isolic α-graphs and isolic ω-graphs will be illustrated by: (i) every infinite graph is isomorphic to some isolic α-graph; (ii) there is an infinite graph which is not isomorphic to any isolic ω-graph. An isolic α-graph is also called a twilight graph. There are c such graphs, c denoting the cardinality of the continuum. (shrink)

A nonnegative interger is called a number, a collection of numbers a set and a collection of sets a class. We write ε for the set of all numbers, o for the empty set, N(α) for the cardinality of $\alpha, \subset$ for inclusion and $\subset_+$ for proper inclusion. Let α, β 1 ,...,β k be subsets of some set ρ. Then α' stands for ρ-α and β 1 ⋯ β k for β 1 ∩ ⋯ ∩ β k . For (...) subsets α 1 ,..., α r of ρ we write: $\alpha_\sigma - \{x \in v \ (\nabla i) \lbrack i \in \sigma \Rightarrow x \in \alpha_i\rbrack\} \text{for} \sigma \subset (1, \ldots, r),\\ s_i = \sum \{N(\alpha_\sigma) \mid \sigma \subset (1,\ldots, r) \& N(\sigma) = i\}, \text{for} 0 \leqq i \leqq r$ . Note that α 0 = v, hence s 0 = N(v). If the set v is finite, the classical inclusion-exclusion principle (abbreviated IEP) states $(a) N(\alpha_1 \cup \cdots \cup \alpha_r) = \sum^r_{t=1} (-1)^{t-1} s_t = \sum_{o \subset_+\sigma \subset (1,\ldots,r)}$ (b) N(α' 1 ⋯ α' r ) = ∑ r t=0 (-1) t s t = ∑ (-1) N(σ) N (α σ ). In this paper we generalize (a) and (b) to the case where α 1 ,⋯, α r are subsets of some countable but isolated set v. Then the role of the cardinality N(α) of the set α is played by the RET (recursive equivalence type) Req α of α. These generalization of (a) and (b) are proved in § 3. Since they involve recursive distinctness, this notion is discussed in § 2. In § 4l we consider a natural extension of "the sum of the elements of a finite set σ" to the case where σ is countable. § 5 deals with valuations, i.e., certain mappings μ from classes of isolated sets into the collection λ of all isols which permit us to further generalize IEP by substituting μ(α) for $\operatorname{Req} \alpha$. (shrink)

In this paper we discuss the following contributions to recursion theory made by John Myhill: two sets are recursively isomorphic iff they are one-one equivalent; two sets are recursively isomorphic iff they are recursively equivalent and their complements are also recursively equivalent; every two creative sets are recursively isomorphic; the recursive analogue of the Cantor–Bernstein theorem; the notion of a combinatorial function and its use in the theory of recursive equivalence types.

In this paper we generalize the pigeonhole principle by using isols as our fundamental counting tool.

In his note [5] Hausner states a simple combinatorial principle, namely: $$(H)\left\{ {\begin{array}{*{20}c} {if f is a function a non - empty finite set \sigma into itself, p a} \\ {prime, f^p = i_\sigma and \sigma _0 the set of fixed points of f, then } \\ {\left| \sigma \right| \equiv \left| {\sigma _0 } \right|(mod p).} \\\end{array}} \right.$$ .He then shows how this principle can be used to prove:Fermat's little theorem,Cauchy's theorem for finite groups,Lucas' theorem for binomial numbers.Letε=(0,1, ...),ℱ (...) 1−1 the family of all one-to-one functions from a subset ofε intoε andℳ 1−1 the family of all p.r. (i.e., partial recursive) one-to-one functions from a subset ofε intoε. A subsetα of ε is finite, ifα is not equivalent to a proper subset under a function inℱ 1−1. The setα is calledisolated, if it is not equivalent to a proper subset under a function inℳ 1−1. An isolated set can also be defined as a subset ofε which has no infinite r.e. (i.e., recursively enumerable) subset. While every finite set is isolated, there are $c = 2^{\aleph _0 }$ infinite sets which are isolated; these sets are calledimmune. It is the purpose of this paper to generalize (H) to a principle (H*) for isolated sets and to show how (H*) can be used to prove generalizations of Fermat's little theorem and Cauchy's theorem for finite groups. We have been unable to generalize Lucas' theorem in a similar manner. (shrink)

This article reviews the strengths and limitations of five major paradigms of medical computer-assisted decision making (CADM): (1) clinical algorithms, (2) statistical analysis of collections of patient data, (3) mathematical models of physical processes, (4) decision analysis, and (5) symbolic reasoning or artificial intelligence (Al). No one technique is best for all applications, and there is recent promising work which combines two or more established techniques. We emphasize both the inherent power of symbolic reasoning and the promise of artificial intelligence (...) and the other techniques to complement each other. (shrink)

The epistemological premises and scientific viability of Stoffregen & Bardy's ecological perspective are evaluated by analyzing the concept of direct perception of global invariants vis-à-vis (1) behavioral evidence that perception is based on the integration of modal sources of information and (2) neurophysiological aspects of the integration of sensory signals.

Rare genetic diseases collectively impact millions of individuals in the United States. These patients and their families share many challenges including delayed diagnosis, lack of knowledgeable providers, and limited economic incentives to develop new therapies for small patient groups. As such, rare disease patients and families often must rely on advocacy, including both self-advocacy to access clinical care and public advocacy to advance research. However, these demands raise serious concerns for equity, as both care and research for a given disease (...) can depend on the education, financial resources, and social capital available to the patients in a given community. In this article, we utilize three case examples to illustrate ethical challenges at the intersection of rare diseases, advocacy and justice, including how reliance on advocacy in rare disease may drive unintended consequences for equity. We conclude with a discussion of opportunities for diverse stakeholders to begin to address these challenges. (shrink)

Background Genuine uncertainty on superiority of one intervention over the other is called equipoise. Physician-investigators in randomized controlled trials need equipoise at least in studies with more than minimal risks. Ideally, this equipoise is also present in patient-participants. In pediatrics, data on equipoise are lacking. We hypothesize that 1) lack of equipoise at enrolment among parents may reduce recruitment; 2) lack of equipoise during participation may reduce retention in patients assigned to a less favoured treatment-strategy. Methods We compared preferences of (...) parents/patients at enrolment, documented by a questionnaire, with preferences developed during follow-up by an interview-study to investigate equipoise of child-participants and parents in the BeSt-for-Kids-study. This trial in new-onset Juvenile Idiopathic Arthritis-patients consists of three strategies. One strategy comprises initial treatment with a biological disease-modifying-antirheumatic-drug, currently not standard-of-care. Semi-structured interviews were conducted with 23 parents and 7 patients, median 11 months after enrolment. Results Initially most parents and children were not in equipoise. Parents/patients who refused participation, regularly declined due to specific preferences. Many participating families preferred the biological-first-strategy. They participated to have a chance for this initial treatment, and would even consider stopping trial-participation when not randomized for it. Their conviction of superiority of the biological-first strategy was based on knowledge from internet and close relations. According to four parents, the physician-investigator preferred the biological-first-strategy, but the majority stated that she had no preferred strategy. In phase 2, preferences tended to change to the treatment actually received. Conclusions Lack of equipoise during enrolment did not reduce study recruitment, mainly due to the fact that preferred treatment was only available within the study. Still, when developing a trial it is important to evaluate whether the physicians’ research question is in line with preferences of the patient-group. By exploring so-called ‘informed patient-group’-equipoise, successful recruitment may be enhanced and bias avoided. In our study, lack of equipoise during trial-participation did not reduce retention in those assigned to a less favoured option. We observed a change for preference towards treatment actually received, possibly explained by comparable outcomes in all three arms. (shrink)

The Oxford Anthology of Literature in the Roman World gathers together critical examples of Roman literature from the earliest poets and playwrights to the last writers of Roman antiquity. Vibrant, witty, and informative, this volume provides a welcome introduction to the literature of our ancient past.